Discovering Deep Knowledge from Relational Data by Attribute-Value Association
نویسندگان
چکیده
Discovering Attribute-Value Association (AVA) is of fundamental importance in knowledge discovery. Market Basket Analysis is an archetypical application. However, most existing algorithms rely only on frequency counts directly obtained from data at the surface and thus cannot reveal deeper knowledge, i.e. the AVAs governed by hidden factors inherent in the data. This paper proposes a new method, called Attribute-Value Association Algorithm (AVAA), which can i) discover statistically significant associations at the Attribute-Value level from relational dataset, ii) disentangle associations to unveil different AVAs corresponding to different hidden factors. The performance of AVAA is validated via experiments on both synthetic and real-world datasets. AVAA demonstrated better identification rate when comparing with Frequent Pattern Mining algorithms, particularly when noise was present. Keywords—Segmentation/Clustering/Association; Explorative and visual data mining
منابع مشابه
Discovering Association Rules in Incomplete Transactional Databases
The problem of incomplete data in the data mining is well known. In the literature many solutions to deal with missing values in various knowledge discovery tasks were presented and discussed. In the area of association rules the problem was presented mainly in the context of relational data. However, the methods proposed for incomplete relational database can not be easily adapted to incomplet...
متن کاملDiscovering Relational Emerging Patterns
The discovery of emerging patterns (EPs) is a descriptive data mining task defined for pre-classified data. It aims at detecting patterns which contrast two classes and has been extensively investigated for attribute-value representations. In this work we propose a method, named Mr-EP, which discovers EPs from data scattered in multiple tables of a relational database. Generated EPs can capture...
متن کاملExploration of the Power of Attribute-oriented Induction in Data Mining
Attribute-oriented induction is a set-oriented database mining method which generalizes the task-relevant subset of data attribute-by-attribute, compresses it into a generalized relation, and extracts from it the general features of data. In this chapter, the power of attribute-oriented induction is explored for the extraction from relational databases of diierent kinds of patterns, including c...
متن کاملCoupling Two Complementary Knowledge Discovery Systems
Lawrence B. Holder and Diane J. Cook University of Texas at Arlington Box 19015, Arlington, TX 76019-0015 Email: fholder,[email protected] Abstract Most approaches to knowledge discovery concentrate on either an attribute-value representation or a structural data representation. The discovery systems for these two representations are typically di erent, and their integration is non-trivial. We ...
متن کاملAn Effective Algorithm for Discovering Fuzzy Rules in Relational Databases
In this paper, we present a novel technique, called F-APACS, for discovering fuzzy association rules in relational databases. Instead of dividing up quantitative attributes into fixed intervals and searching for rules expressed in terms of them, F-APACS employs linguistic terms to represent the revealed regularities and exceptions. The definitions of these linguistic terms are based on fuzzy se...
متن کامل